A paradigmatic approach to investigate restricted hyper totient graphs

Nowadays, the problem of finding families graphs for which one may ensure existence a vertex-labeling and/or an edge-labeling based on certain class integers, constitutes challenge researchers in both number and graph theory. In this paper, we focus those vertex-labelings whose induced multiplicative assigns hyper totient numbers to edges graph. way, introduce characterize notions restricted particular, prove that every finite is determine under assumptions following constitute graphs: complete graphs, star bipartite wheel cycles, paths, fan friendship graphs.